Matrix Chain Multiplication and Equivalent Reduced-Order Parallel Calculation Method for a Robotic Arm

نویسندگان

چکیده

Intelligence development has put forward increasing requirements of real-time planning and dynamic feedback in controlling robotic arms. It become essential engineering applications to complete the kinematics calculation complex manipulators real time. This paper proposes a matrix cascading multiplication equivalent reduced-order parallel computing method for homogeneous matrices process inverse solutions, which reduces order according distribution zero vectors calculations. The removes unnecessary joint matrixes containing vectors. obtains optimal cascade through searches, improving efficiency effective dot product by computation. Calculation processes specific examples are presented this paper. Compared with previous algorithms, proposed algorithm cycle 90%, effectively control process.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A New Parallel Matrix Multiplication Method Adapted on Fibonacci Hypercube Structure

The objective of this study was to develop a new optimal parallel algorithm for matrix multiplication which could run on a Fibonacci Hypercube structure. Most of the popular algorithms for parallel matrix multiplication can not run on Fibonacci Hypercube structure, therefore giving a method that can be run on all structures especially Fibonacci Hypercube structure is necessary for parallel matr...

متن کامل

a new parallel matrix multiplication method adapted on fibonacci hypercube structure

the objective of this study was to develop a new optimal parallel algorithm for matrix multiplication which could run on a fibonacci hypercube structure. most of the popular algorithms for parallel matrix multiplication can not run on fibonacci hypercube structure, therefore giving a method that can be run on all structures especially fibonacci hypercube structure is necessary for parallel matr...

متن کامل

Highly Parallel Sparse Matrix-Matrix Multiplication

Generalized sparse matrix-matrix multiplication is a key primitive for many high performance graph algorithms as well as some linear solvers such as multigrid. We present the first parallel algorithms that achieve increasing speedups for an unbounded number of processors. Our algorithms are based on two-dimensional block distribution of sparse matrices where serial sections use a novel hyperspa...

متن کامل

Stepwise Derivation of a Parallel Matrix Multiplication

A standard multiplication algorithm for square matrices is transformed into a distributed algorithm. Every transformation step is veriied within the reenement calculus. Some high-level rules of reenement that are used in the derivation are proved.

متن کامل

Parallel Matrix Multiplication: A Systematic Journey

We expose a systematic approach for developing distributed memory parallel matrix matrix multiplication algorithms. The journey starts with a description of how matrices are distributed to meshes of nodes (e.g., MPI processes), relates these distributions to scalable parallel implementation of matrix-vector multiplication and rank-1 update, continues on to reveal a family of matrix-matrix multi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Applied sciences

سال: 2023

ISSN: ['2076-3417']

DOI: https://doi.org/10.3390/app13031931